computational complexity theory

Results: 2049



#Item
871Ultra-Efficient (Embedded) SOC Architectures based on Probabilistic CMOS (PCMOS) Technology∗ Lakshmi N. Chakrapani Bilge E. S. Akgul Suresh Cheemalavagu Krishna V. Palem

Ultra-Efficient (Embedded) SOC Architectures based on Probabilistic CMOS (PCMOS) Technology∗ Lakshmi N. Chakrapani Bilge E. S. Akgul Suresh Cheemalavagu Krishna V. Palem

Add to Reading List

Source URL: www.ece.rice.edu

Language: English - Date: 2012-08-15 22:04:00
872Combining Constraint Propagation and Discrete Ellipsoid-Based Search to Solve the Exact Quadratic Knapsack Problem Wen-Yang Ku and J. Christopher Beck Department of Mechanical & Industrial Engineering University of Toron

Combining Constraint Propagation and Discrete Ellipsoid-Based Search to Solve the Exact Quadratic Knapsack Problem Wen-Yang Ku and J. Christopher Beck Department of Mechanical & Industrial Engineering University of Toron

Add to Reading List

Source URL: tidel.mie.utoronto.ca

Language: English - Date: 2015-01-28 09:11:33
873manhat-conn-xact-color.dvi

manhat-conn-xact-color.dvi

Add to Reading List

Source URL: daniel-wilkerson.appspot.com

Language: English
874A Polynomial Time Approximation Scheme for k-Consensus Clustering∗ Tom Coleman† Abstract This paper introduces a polynomial time approximation scheme for the metric Correlation Clustering problem, when the number of

A Polynomial Time Approximation Scheme for k-Consensus Clustering∗ Tom Coleman† Abstract This paper introduces a polynomial time approximation scheme for the metric Correlation Clustering problem, when the number of

Add to Reading List

Source URL: tom.thesnail.org

Language: English - Date: 2015-05-04 03:09:24
875Errata and Addenda for “Informatics Everywhere” [7] Tom Verhoeff JuneErrata

Errata and Addenda for “Informatics Everywhere” [7] Tom Verhoeff JuneErrata

Add to Reading List

Source URL: www.win.tue.nl

Language: English - Date: 2013-06-26 17:51:21
876Job Shop Scheduling with Probabilistic Durations1 J. Christopher Beck and Nic Wilson2 Abstract. Proactive approaches to scheduling take into account information about the execution time uncertainty in forming a schedule.

Job Shop Scheduling with Probabilistic Durations1 J. Christopher Beck and Nic Wilson2 Abstract. Proactive approaches to scheduling take into account information about the execution time uncertainty in forming a schedule.

Add to Reading List

Source URL: tidel.mie.utoronto.ca

Language: English - Date: 2006-01-18 12:07:28
877Solving the Maximum Agreement Subtree and Maximum Compatible Tree problems on bounded degree trees Sylvain Guillemot, Fran¸cois Nicolas LIRMM, Montpellier France

Solving the Maximum Agreement Subtree and Maximum Compatible Tree problems on bounded degree trees Sylvain Guillemot, Fran¸cois Nicolas LIRMM, Montpellier France

Add to Reading List

Source URL: www.cs.ucr.edu

Language: English - Date: 2006-07-28 09:21:00
878Parallelism  in Sequential Guy  Blelloch

Parallelism in Sequential Guy Blelloch

Add to Reading List

Source URL: www.cs.cmu.edu

Language: English - Date: 2011-04-26 13:42:59
879Computational Aesthetics in Graphics, Visualization, and ImagingD. W. Cunningham, G. Meyer, L. Neumann (Editors) Conceptualizing Birkhoff’s Aesthetic Measure Using Shannon Entropy and Kolmogorov Complexity Jaum

Computational Aesthetics in Graphics, Visualization, and ImagingD. W. Cunningham, G. Meyer, L. Neumann (Editors) Conceptualizing Birkhoff’s Aesthetic Measure Using Shannon Entropy and Kolmogorov Complexity Jaum

Add to Reading List

Source URL: ima.udg.es

Language: English - Date: 2012-10-27 15:49:16
880A Linear Kernel for the Complementary Maximal Strip Recovery Problem Binhai Zhu  Computer Science Department

A Linear Kernel for the Complementary Maximal Strip Recovery Problem Binhai Zhu Computer Science Department

Add to Reading List

Source URL: www.cs.ucr.edu

Language: English - Date: 2012-12-29 15:19:34